Poset Convex-ear Decompositions and Applications to the Flag H-vector

نویسنده

  • Jay Joel Schweig
چکیده

Possibly the most fundamental combinatorial invariant associated to a finite simplicial complex is its f-vector, the integral sequence expressing the number of faces of the complex in each dimension. The h-vector of a complex is obtained by applying a simple invertible transformation to its f-vector, and thus the two contain the same information. Because some properties of the f-vector are easier expressed after applying this transformation , the h-vector has been the subject of much study in geometric and algebraic combinatorics. A convex-ear decomposition, first introduced by Chari in [7], is a way of writing a simplicial complex as a union of subcomplexes of simplicial polytope boundaries. When a (d − 1)-dimensional complex admits such a decomposition, its h-vector satisfies, for i < d/2, h i ≤ h i+1 and h i ≤ h d−i. Furthermore, its g-vector is an M-vector. We give convex-ear decompositions for the order complexes of rank-selected sub-posets of supersolvable lattices with nowhere-zero Möbius functions, rank-selected sub-posets of geometric lattices, and rank-selected face posets of shellable complexes (when the rank-selection does not include the maximal rank). Using these decompositions, we are able to show inequalities for the flag h-vectors of supersolvable lattices and face posets of Cohen-Macaulay complexes. Finally, we turn our attention to the h-vectors of lattice path matroids. A lattice path matroid is a certain type of transversal matroid whose bases correspond to planar lattice paths. We verify a conjecture of Stanley in the special case of lattice path matroids and, in doing so, introduce an interesting new class of monomial order ideals. relocation, he and his family finally settled in the Washington, D.C. suburb of Hern-don, Virginia. Jay attended Oakton High School, and later enrolled in nearby George Mason University as a philosophy major. Two years and many Aristotle treatises later, Jay switched to a mathematics concentration. After obtaining a bachelor's degree, Jay worked several odd jobs in the Northern Virginia area. He eventually entered the mathematics Ph.D. program at Cornell University in Ithaca, New York, initially as a topologist. Six short years later, his advisor suggested that he graduate. After graduation, Jay will be a Robert D. Adams visiting assistant professor at the University of Kansas.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex-Ear Decompositions and the Flag h-Vector

We prove a theorem allowing us to find convex-ear decompositions for rankselected subposets of posets that are unions of Boolean sublattices in a coherent fashion. We then apply this theorem to geometric lattices and face posets of shellable complexes, obtaining new inequalities for their h-vectors. Finally, we use the latter decomposition to give a new interpretation to inequalities satisfied ...

متن کامل

Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes

This paper introduces two new decomposition techniques which are related to the classical notion of shellability of simplicial complexes, and uses the existence of these decompositions to deduce certain numerical properties for an associated enumerative invariant. First, we introduce the notion of M-shellability, which is a generalization to pure posets of the property of shellability of simpli...

متن کامل

g-Elements, finite buildings and higher Cohen-Macaulay connectivity

Chari proved that if ∆ is a (d − 1)-dimensional simplicial complex with a convex ear decomposition, then h0 ≤ · · · ≤ hbd/2c [7]. Nyman and Swartz raised the problem of whether or not the corresponding g-vector is an M -vector [18]. This is proved to be true by showing that the set of pairs (ω,Θ), where Θ is a l.s.o.p. for k[∆], the face ring of ∆, and ω is a g-element for k[∆]/Θ, is nonempty w...

متن کامل

Several Convex-Ear Decompositions

In this paper we give convex-ear decompositions for the order complexes of several classes of posets, namely supersolvable lattices with non-zero Möbius functions and rank-selected subposets of such lattices, rank-selected geometric lattices, and rank-selected face posets of shellable complexes which do not include the top rank. These decompositions give us many new inequalities for the h-vecto...

متن کامل

Cubical Convex Ear Decompositions

We consider the problem of constructing a convex ear decomposition for a poset. The usual technique, introduced by Nyman and Swartz, starts with a CL-labeling and uses this to shell the ‘ears’ of the decomposition. We axiomatize the necessary conditions for this technique as a “CL-ced” or “EL-ced”. We find an EL-ced of the d-divisible partition lattice, and a closely related convex ear decompos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008